[20251207] BOJ / G5 / 벽장문의 이동 / 이준희 #1605
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
🧷 문제 링크
https://www.acmicpc.net/problem/2666
🧭 풀이 시간
60분
👀 체감 난이도
✏️ 문제 설명
벽장이 있고 그 벽장은 2칸이 열리는 미닫이 벽장일 때
초기 상태가 주어지고 각 순서대로 사용해야할 벽장을 최소한의 문 이동으로 사용하는 경우를 구하는 문제입니다.
🔍 풀이 방법
dp를 이용해서 풀었습니다. 3중배열로 dp[i][a][b] 는 i번째 시간에 a칸, b칸이 열려있을 때 문을 움직인 거리를 나타냅니다.
각 순간마다 a문을 이동, b문을 이동하는 경우 모두 계산했습니다.
⏳ 회고
방법 자체가 잘 안떠올라서 오래 걸렸던 문제였습니다.